The automation of syllogistic I. Syllogistic normal forms
نویسندگان
چکیده
منابع مشابه
The propositional and relational syllogistic∗
In this paper it is shown how syllogistic reasoning can be extended to account for propositional logic and relations.
متن کاملThe Hamiltonian Syllogistic
This paper undertakes a re-examination of Sir William Hamilton’s doctrine of the quantification of the predicate. Hamilton’s doctrine comprises two theses. First, the predicates of traditional syllogistic sentence-forms contain implicit existential quantifiers, so that, for example, All p are q is to be understood as All p are some q. Second, these implicit quantifiers can be meaningfully duali...
متن کاملThe Syllogistic with Unity
We extend the language of the classical syllogisms with the sentenceforms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowed.
متن کاملThe Fuzzy Syllogistic System
A categorical syllogism is a rule of inference, consisting of two premisses and one conclusion. Every premiss and conclusion consists of dual relationships between the objects M, P, S. Logicians usually use only true syllogisms for deductive reasoning. After predicate logic had superseded syllogisms in the 19th century, interest on the syllogistic system vanished. We have analysed the syllogist...
متن کاملLogics for the Relational Syllogistic
The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a) whether negation is permitted on all nouns, including those in the subject of a sentence; and (b) whether the subject noun phrase may contain a relative clause...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1988
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(88)80023-3